Lagrange Multiplier Method for Convex Programs

Nonlinear Programs with Unbounded Lagrange Multiplier Sets

We investigate nonlinear programs that have a nonempty but possibly unbounded Lagrange multiplier set and that satisfy the quadraticgrowth condition. We show that such programs can be transformed, by relaxing the constraints and adding a linear penalty term to the objective function, into equivalent nonlinear programs that have diierentiable data and a bounded Lagrange multiplier set and that s...

The Lagrange Multiplier Method for Dirichlet's Problem

The Lagrange multiplier method of Babuska for the approximate solution of Dirichlet's problem for second order elliptic equations is reformulated. Based on this formulation, new estimates for the error in the solution and the boundary flux are given. Efficient methods for the solution of the approximate problem are discussed.

Multiple Lagrange Multiplier Method for Constrained Evolutionary Optimization

One of the well-known problems in evolutionary search for solving optimization problem is the premature convergence. The general constrained optimization techniques such as hybrid evolutionary programming, two{phase evolutionary programming, and Evolian algorithms are not safe from the same problem in the rst phase. To overcome this problem, we apply the sharing function to the Evolian algorith...

A Lagrange Multiplier Method for Certain Constrained Min-Max Problems

Lagrange Multiplier Method for Multi-campaign Assignment Problem

It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when performing several personalized campaigns simultaneously. We formulate the multi-campaign assignment problem to solve this issue and propose methods for solving the problem. The most notable element is the Lagrange mult...